package leetcode;

/**
 * @author le
 */
public class Text03
{
    public boolean hasPathSum(TreeNode root, int targetSum) {

        if (root == null){
            return false;
        }

        if (root.left == null && root.right == null){
            return targetSum == root.val;
        }

        return hasPathSum(root.left, targetSum-root.val) || hasPathSum(root.right, targetSum-root.val);
    }


}

class TreeNode {
    int val;
    TreeNode left;
    TreeNode right;
    TreeNode() {}
    TreeNode(int val) { this.val = val; }
    TreeNode(int val, TreeNode left, TreeNode right) {
        this.val = val;
        this.left = left;
        this.right = right;
    }
}